Comparing K Populations with Linear Rank Statistics
نویسندگان
چکیده
منابع مشابه
Empirical performance maximization for linear rank statistics
The ROC curve is known to be the golden standard for measuring performance of a test/scoring statistic regarding its capacity of discrimination between two populations in a wide variety of applications, ranging from anomaly detection in signal processing to information retrieval, through medical diagnosis. Most practical performance measures used in scoring applications such as the AUC, the loc...
متن کاملOrder-Restricted Inference with Linear Rank Statistics in Microarray Data
The classification of subjects with unknown distribution in a small sample size often involves order-restricted constraints in multivariate parameter setups. Those problems make the optimality of a conventional likelihood ratio based statistical inferences not feasible. Fortunately, Roy (1953) introduced union-intersection principle(UIP) which provides an alternative avenue. Multivariate linear...
متن کاملComputational rank-based statistics
This review discusses two algorithms which can be used to compute rank-based regression estimates. For completeness, a brief overview of rank-based inference procedures in the context of a linear model is presented. The discussion includes geometry, estimation, inference, and diagnostics. In regard to computing the rank-based estimates, we discuss two approaches. The first approach is based on ...
متن کاملRank Statistics in Biological Evolution
We present a statistical analysis of biological evolution processes. Specifically, we study the stochastic replication-mutation-death model where the population of a species may grow or shrink by birth or death, respectively, and additionally, mutations lead to the creation of new species. We rank the various species by the chronological order by which they originate. The average population Nk ...
متن کاملPrivacy and Efficiency Tradeoffs for Multiword Top K Search with Linear Additive Rank Scoring
This paper proposes a private ranking scheme with linear additive scoring for efficient top K keyword search on modest-sized cloud datasets. This scheme strikes for tradeoffs between privacy and efficiency by proposing single-round client-server collaboration with server-side partial ranking based on blinded feature weights with random masks. Client-side preprocessing includes query decompositi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 1986
ISSN: 0162-1459
DOI: 10.2307/2289077